Mean value analysis for polling systems

نویسندگان

  • Erik M. M. Winands
  • Ivo J. B. F. Adan
  • Geert-Jan van Houtum
چکیده

The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic simplicity and its intuitively appealing derivation. As a consequence, MVA may be applied, both in an exact and approximate manner, to a large variety of models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On polling systems with large setups

Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling systems when the setup times tend to infinity. Based on the recently proposed mean value analysis (MVA) for polling systems, a novel simple approach is developed to show that the scaled delay distribution converges to a uni...

متن کامل

Scheduling in polling systems

We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling system...

متن کامل

Heavy traffic analysis of polling models by mean value analysis

In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at each queue, and with general service-time and switch-over time distributions, and study its behavior when the load tends to one. For this model, we explore the recently proposed mean value analysis (MVA), which takes a...

متن کامل

When Does Forced Idle Time Improve Performance in Polling Models?

Sarkar and Zangwill (1991) showed by numerical examples that reduction in setup times can, surprisingly, actually increase work in process in some cyclic production systems (that is, reduction in switchover times can increase waiting times in some polling models). We present, for polling models with exhaustive and gated service disciplines, some explicit formulas that provide additional insight...

متن کامل

Analysis and Optimization of Polling Systems

The basic polling system is a system of multiple queues, attended to by a single server in a cyclic order. Polling systems arise naturally in the modelling of many communication, computer and production networks where several users compete for access to a common resource. Such applications also give rise to several variants of the basic polling system, like periodic polling; here the server vis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2006